A Framework for the Specification of Random SAT and QSAT Formulas
نویسندگان
چکیده
We present the framework [q]bfGen which allows the declarative specification of random models for generating SAT and QSAT formulas not necessarily in (prenex) conjunctive normal form. To this end, [q]bfGen realizes a generic formula generator which creates formula instances by interpreting the random model specification expressed in XML. Consequently, the implementation of specific random formula generators becomes obsolete, because our framework subsumes their func-
منابع مشابه
The threshold for random (1,2)-QSAT
The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random quantified extended 2-CNF formulas. We consider boolean CNF formulas of the form ∀X∃Y ϕ(X, Y), where X has m variables, Y has n variables and each clause in ϕ has one literal from X and two from Y. For such formulas , we...
متن کاملStructure in #SAT and QBF
Computational problems that are intractable in general can often be efficiently resolved in practice due to latent structure in real-world instances. This thesis considers structural properties that can be used in the design of more efficient algorithms for two highly intractable problems: the satisfiability problem of quantified Boolean formulas (QSAT) and propositional model counting (#SAT). ...
متن کاملClause Elimination for SAT and QSAT
The famous archetypical NP-complete problemof Boolean satisfiability (SAT) and its PSPACEcomplete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of various computationally hard problems can be efficiently solved. This success has been achieved through several breakthroughs in practical implement...
متن کاملWorst-Case Upper Bound for (1, 2)-QSAT
The rigorous theoretical analysis of the algorithm for a subclass of QSAT, i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first introduced in SAT’08, can be seen as quantified extended 2-CNF formulas. Until now, within our knowledge, there exists no algorithm presenting the worst upper bound for (1, 2)-QSAT. Therefore in this paper, we present an exact algorithm to solve (1...
متن کاملBeyond NP: the QSAT phase transition
We show that phase transition behavior similar to that observed in NP-complete problems like random 3-SAT occurs further up the polynomial hierarchy in problems like random 2-QSAT. The differences between QSAT and SAT in phase transition behavior that Cadoli et al report are largely due to the presence of trivially unsatisfiable problems. Once they are removed, we see behavior more familiar fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012